package tree;

import java.util.List;

/**
 * 中序遍历（左-中-右）
 * 简单
 * https://leetcode-cn.com/problems/binary-tree-inorder-traversal/
 */
public class InorderTraversal {

    public static void main(String[] args) {

    }

//    public List<Integer> inorderTraversal(TreeNode root) {
//
//    }

    public class TreeNode {
        int val;
        SerializeBinaryTree.TreeNode left;
        SerializeBinaryTree.TreeNode right;
        TreeNode(int x) { val = x; }
    }
}
